Proving Termination of Input
ثبت نشده
چکیده
منابع مشابه
توسعه روش SL با ترتیب KBO برای اثبات خودکار پایانپذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کاملOn Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
In this paper, we propose methods for proving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are assumed to be sound for the interpretation. To this end, we extend the dependency pair framework for proving termination of unconstrained term rewriting systems to constrained term rewriting systems. Moreov...
متن کاملProving Mutual Termination of Programs
Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest a proof rule that uses a mapping between the functions of the two programs for proving mutual termination of functions f , f . The rule’s premise requires proving that given the same arbitrary input in, f(in) and f (in) call mapped functions with the same arguments. A variant of this rule w...
متن کاملProving mutual termination
Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest inference rules and a proof system for proving mutual termination of a given pair of procedures 〈f , f ′〉 and the respective subprograms that they call under a free context. Given a (possibly partial) mapping between the procedures of the two programs, the premise of the rule requires provi...
متن کاملEmbracing Overapproximation for Proving Nontermination
One of the most fundamental program properties is termination: a program’s execution will end regardless of its input. Bugs due to nontermination of a subroutine can be a nuisance, particularly since they cannot reliably be detected by testing. Although termination is undecidable, in practice we can use incomplete but effective methods to prove termination. However, failure to find a terminatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999